Extending Partial Representations of Proper and Unit Interval Graphs
نویسندگان
چکیده
منابع مشابه
Extending Partial Representations of Unit Circular-arc Graphs
The partial representation extension problem, introduced by Klav́ık et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.
متن کاملBounded Representations of Interval and Proper Interval Graphs
Klav́ık et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex v two intervals Lv and Rv called bounds. We ask whether there exists a bounded representation in which each interval Iv has its left endpoint ...
متن کاملExtending Partial Representations of Circle Graphs
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some pre-drawn chords that represent an induced subgraph of G. The ques...
متن کاملExtending Partial Representations of Function Graphs and Permutation Graphs
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0, 1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear. We focus on the problem of extending partial representations...
متن کاملThe Roberts characterization of proper and unit interval graphs
In this note, a constructive proof that the classes of proper interval graphs and unit interval graphs coincide is given, a result originally established by Fred S. Roberts. Additionally, the proof yields a linear-time and space algorithm to compute a unit interval representation, given a proper interval graph as input. © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0133-z